منابع مشابه
Algebraic verification of a distributed summation algorithm
In this note we present an algebraic veriication of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for veriication exercises (see 2, 13, 8]). The veriication is based on the methodology presented in 7] and demonstrates its applicability to distributed algorithms.
متن کاملRelation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm
We formally prove the correctness of Prim’s algorithm for computing minimum spanning trees. We introduce new generalisations of relation algebras and Kleene algebras, in which most of the proof can be carried out. Only a small part needs additional operations, for which we introduce a new algebraic structure. We instantiate these algebras by matrices over extended reals, which model the weighte...
متن کاملAutomatic Verification of Algebraic Transformations
Programmers applying nontrivial code transformations are often faced with the problem of ensuring the functional equivalence of original and transformed programs. A pragmatic approach to the problem is to provide a tool to the programmers to check the equivalence of the two programs after applying the transformations. In prior work we have developed such a tool to handle important transformatio...
متن کاملMIZAR verification of generic algebraic algorithms
Although generic programming founds more and more attention | nowadays generic programming languages as well as generic libraries exist | there are hardly approaches for the veri cation of generic algorithms or generic libraries. This thesis deals with generic algorithms in the eld of computer algebra. We propose theMizar system as a theorem prover capable of verifying generic algorithms on an ...
متن کاملFormalization and Algebraic Verification of Legal Requirements
This paper outlines the technology of the formalization and verification of legal text documents. A formal model of a legal document is presented as an ordered set of rules. Every rule is presented as a triple containing preand post-conditions, as well as process parts. All rules are ordered in Use Case Maps (UCM) diagrams. Such a formal model can be verified for inconsistency and incompletenes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of System Modeling and Simulation
سال: 2018
ISSN: 2518-0959
DOI: 10.24178/ijsms.2018.3.1.07